A modified multilevel k-way partitioning algorithm for trip-based road networks
نویسندگان
چکیده
منابع مشابه
A Multilevel k–way Partitioning Algorithm for Finite Element Meshes using Competing Ant Colonies
The self–organizing properties of ant colonies are employed to tackle the classical combinatorial optimization problem of graph partitioning. Structural information from the graph is mapped onto an environment upon which a number of colonies compete for resources. Using Genetic Programming, a Foraging Strategy is evolved which when executed by the ants in each colony leads to a restructuring of...
متن کاملMultilevel k-way Partitioning Scheme for Irregular Graphs
In this paper we present and study a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, find a k-way partitioning of the smaller graph, and then uncoarsen and refine it to construct a k-way partitioning for the original graph. These algorithms compute a k-way partitioning of a graph G = (V, E) in O(|E |) time which is faster by a factor of...
متن کاملA Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for high latency message-passing libraries. The multilevel k-way partitioning algorithm reduces the size of the graph by collapsing vertices and edges (coarsening phase), finds a k-way partitioning of the smaller graph, and then it constructs a k-way partitioning for t...
متن کاملA Clustering Based Linear Ordering Algorithm for K-Way Spectral Partitioning
The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mapped to n points in d-dimensional space, and then a linear ordering of these n modules is constructed to be used as a basis for partitioning. In this paper, we propose two clustering based linear ordering algorithms takin...
متن کاملA distributed multilevel ant-colony algorithm for the multi-way graph partitioning
The graph-partitioning problem arises as a fundamental problem in many important scientific and engineering applications. A variety of optimisation methods are used for solving this problem and among them the meta-heuristics outstand for its efficiency and robustness. Here, we address the performance of the distributed multilevel ant-colony algorithm (DMACA), a meta-heuristic approach for solvi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2019
ISSN: 2261-236X
DOI: 10.1051/matecconf/201927201038